Transductions des langages de Chomsky

Langages reconnaissables de mots indexés par des ordinaux

Des grammaires de graphes contextuelles qui charactérisent les langages contextuels

Deterministic graph grammars generate a family of infinite graphs which characterize context-free (word) languages. In this paper we presents a context-sensitive extension of these grammars. We achieve a characterization of context-sensitive (word) languages. We show that this characterization is not straightforward and that unless having some rigorous restrictions, contextual graph grammars ge...

Qualité des langages de modélisation et des modèles : vers un catalogue des patrons collaboratifs

The quality of modeling languages and models as well as their evaluation are an important concern for the designer. Moreover, the proliferation of quality concepts’ definition and the large number of works that appear every day, require the structuring and the pooling of knowledge of this field. In this paper, we propose a collaboratif patterns’ system that capitalizes the knowledge on the qual...

Pratique des langages fonctionnels Types

Une Extension des Langages Déterministes

— In this article, we define afamily of context free languages, the quasi deterministic languages, which is strictly inserted between the families of deterministic and non ambiguous context free languages. The family is closed under complement, intersection with a rational set, inverse homomorphism... On the contrary, it is not closed under mirror image but the languages the mirror image of whi...